A Low Overhead Dynamic Path Scheme for Ad Hoc Networks
نویسندگان
چکیده
AODV is a famous routing protocol for mobile ad hoc networks. The routing path will not change during data transmission unless a link failure occurs. For the mobile nodes in an ad hoc network may move arbitrarily, some nodes in the routing path may turn to be redundant. On the other hand, when a link between nodes is tending to be broken, the nodes in the middle way of the link are turn to be valuable ones. In this paper, we propose a simple dynamic path scheme for ad hoc networks just by keeping little information in mobile nodes and turning on the overhearing function of mobile nodes. The simulation results show that the proposed scheme does improve the performance of the AODV protocol
منابع مشابه
The Feedback Based Mechanism for Video Streaming Over Multipath Ad Hoc Networks
Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...
متن کاملAdaptive Path Energy Conserving Routing in MANETs
The specific features of mobile ad hoc networks (MANETs) impose new requirements for routing protocols. The aim of this paper is to present an approach that enhances routing performance by integrating ad hoc related characteristics. We propose a loop-free adaptive path energy conserving scheme which attempts to minimize both routing and storage overhead in order to efficiently provide robustnes...
متن کاملHoc Networks Using Hierarchical Routing Algorithm
To improve the Routing the Enhanced Routing protocol mechanism is used in Mobile ad hoc networks. The EHRP provides efficient and reliable routing paths. EHRP is compatible which reduces routing overhead and route discovery delay of the mobile ad hoc networks. The shortest hierarchical path is calculated based on the cluster head of different Clusters using the Cluster Table addressing scheme w...
متن کاملA highly reliable multi-path routing scheme for ad hoc wireless networks
This paper presents a new routing scheme for ad hoc wireless networks that provides fresh routing information along active routes with affordable cost. The proposed routing mechanism, called proactive route maintenance (PRM), is used to replace the naive route mechanism in existing reactive (on-demand) routing protocols to enhance route reliability and reduce the frequency of expensive route di...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کامل